Phase matching condition for quantum search with a generalized initial state
نویسندگان
چکیده
We present a general phase matching condition for the quantum search algorithm with arbitrary unitary transformation and arbitrary phase rotations in the case of a general initial state. We show by an explicit expression that the phase matching condition depends both on the unitary transformation U and the initial state. We show that several phase conditions previously discussed in the literature are special cases of this general one, which clarifies the question of which condition should be regarded as exact. 2002 Elsevier Science B.V. All rights reserved. PACS: 03.67.Lx; 03.67.Hk; 89.70.+c
منابع مشابه
An improved phase error tolerance in quantum search algorithm
As the matching condition in Grover search algorithm is transgressed due to inevitable errors in phase inversions, it gives a reduction in maximum probability of success. With a given degree of maximum success, we have derive the generalized and imroved criterion for tolerated error and corresponding size of quantum database under the inevitable gate imperfections. The vanished inaccurancy to t...
متن کاملPhase Matching in Quantum Searching
Each iteration in Grover’s original quantum search algorithm contains 4 steps: two Hadamard-Walsh transformations and two amplitudes inversions. When the inversion of the marked state is replaced by arbitrary phase rotation θ and the inversion for the prepared state |γ〉 is replaced by rotation through φ, we found that these phase rotations must satisfy a matching condition θ = φ. Approximate fo...
متن کاملA Novel SO(3) Picture for Quantum Searching
An SO(3) picture of the generalized Grover’s quantum searching algorithm,with arbitrary unitary transformation and with arbitrary phase rotations, is constructed. In this picture, any quantum search operation is a rotation in a 3 dimensional space. Exact formulas for the rotation angle and rotational axis are given. The probability of finding the marked state is just (z +1)/2, where z is the z-...
متن کاملExperimental NMR Realization of A Generalized Quantum Search Algorithm
A generalized quantum search algorithm, where phase inversions for the marked state and the prepared state are replaced by π/2 phase rotations, is realized in a 2-qubit NMR heteronuclear system. The quantum algorithm searches a marked state with a smaller step compared to standard Grover algorithm. Phase matching requirement in quantum searching is demonstrated by comparing it with another gene...
متن کاملA General SU (2) Formulation for Quantum Searching with Certainty
A general quantum search algorithm with arbitrary unitary transformations and an arbitrary initial state is considered in this work. To serach a marked state with certainty, we have derived, using an SU(2) representation: (1) the matching condition relating the phase rotations in the algorithm, (2) a concise formula for evaluating the required number of iterations for the search, and (3) the fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002